Search downward: Minimal Search-based Agree

Minimal Model Complexity Search

SURFER is an empirical discovery system that given a set of input data and a modelling vocabulary returns the model that best describes that data. The best model is considered to be the one that minimizes the description length of that model plus the data encoded using that model. The search for models is controlled by the a priori estimate of model likelihoods as encoded in the modelling vocab...

Minimal Indices for Successor Search

We give a new successor data structure which improves upon the index size of the Pǎtraşcu-Thorup data structures, reducing the index size from O(nw) bits to O(n logw) bits, with optimal probe complexity. Alternatively, our new data structure can be viewed as matching the space complexity of the (probe-suboptimal) z-fast trie of Belazzougui et al. Thus, we get the best of both approaches with re...

Proof Search in Minimal Logic

Progressive Minimal Criteria Novelty Search

We propose progressive minimal criteria novelty search (PMCNS), which is an extension of minimal criteria novelty search. In PMCNS, we combine the respective benefits of novelty search and fitnessbased evolution by letting novelty search freely explore new regions of behaviour space as long as the solutions meet a progressively stricter fitness criterion. We evaluate the performance of our appr...

Minimal Interaction Search: Multi-Way Search with Item Categories

Extensive online collections of content exist, such as music, books, movies, and various others. Search in these collections is typically implemented in two ways, typing attributes of interest into a search box, or progressively navigating through series of menus with item categories to a list of desired items. In this paper, we focus on the latter approach. In particular, we propose a strategy...